The Complexity of Indefinite Elliptic Problems with Noisy Data

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Complexity of Indefinite Elliptic Problems with Noisy Data

We study the complexity of second-order indeenite elliptic problems ?div(aru) + bu = f (with homogeneous Dirichlet boundary conditions) over a d-dimensional domain , the error being measured in the H 1 (()-norm. The problem elements f belong to the unit ball of W r;p ((), where p 2 2; 1] and r > d=p. Information consists of (possibly-adaptive) noisy evaluations of f , a, or b (or their derivati...

متن کامل

Complexity of Indefinite Elliptic Problems By Arthur

This paper deals with the approximate solution of a linear regularly-elliptic 2mth-order boundary-value problem Lu = f, with / 6 Hr(Q) for r > —m. Suppose that the problem is indefinite, i.e., the variational form of the problem involves a weaklycoercive bilinear form. Of particular interest is the quality of the finite element method (FEM) of degree k using n inner products of /. The error of ...

متن کامل

Asymmetric Elliptic Problems with Indefinite Weights

– We prove the existence of a first nontrivial eigenvalue for an asymmetric elliptic problem with weights involving the laplacian (cf. (1.2) below) or more generally the p-laplacian (cf. (1.3) below). A first application is given to the description of the beginning of the Fučik spectrum with weights for these operators. Another application concerns the study of nonresonance for the problems (1....

متن کامل

The Complexity of Multivariate Elliptic Problems with Analytic Data

Let F be a class of functions deened on a d-dimensional domain. Our task is to compute H m-norm "-approximations to solutions of 2mth-order elliptic boundary-value problems Lu = f for a xed L and for f 2 F. We assume that the only information we can compute about f 2 F is the value of a nite number of continuous linear functionals of f, each evaluation having cost c(d). Previous work has assume...

متن کامل

The complexity of de nite elliptic problems with noisy dataTechnical Report CUCS - 035 - 96

We study the complexity of 2mth order deenite elliptic problems Lu = f (with homogeneous Dirichlet boundary conditions) over a d-dimensional domain , error being measured in the H m (()-norm. The problem elements f belong to the unit ball of W r;p ((), where p 2 2; 1] and r > d=p. Information consists of (possibly-adaptive) noisy evaluations of f or the coeecients of L. The absolute error in ea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Complexity

سال: 1997

ISSN: 0885-064X

DOI: 10.1006/jcom.1997.0456